Loop Pipelining for Scheduling Multi -
نویسندگان
چکیده
? Multi-dimensional (MD) systems are widely used in scientiic applications such as image processing, geophysical signal processing and uid dynamics. Earlier scheduling methods in synthesizing MD systems do not explore loop pipelining across diierent dimensions. This paper explores the basic properties of MD loop pipelining and presents an algorithm, called multi-dimensional rotation scheduling, to nd an eecient schedule based on the multi-dimensional retiming technique we developed. The description and the correctness of our algorithm are presented in the paper. The experiments show that our algorithm can achieve optimal results eeciently.
منابع مشابه
Multi-dimensional Kernel Generation for Loop Nest Software Pipelining
Single-dimension Software Pipelining (SSP) has been proposed as an effective software pipelining technique for multidimensional loops [18]. However, the scheduling methods that actually produce the kernel code have not been published yet. Because of the multi-dimensional nature of SSP kernels, the scheduling problem is more complex and challenging than with modulo scheduling. The scheduler must...
متن کاملA novel framework for multi-rate scheduling in DSP applications
Net model for ne-grain loop scheduling. [7] S. Ha and E.A. Lee. Compile-time scheduling and assignment of data-BLOCKINow program graphs with data-dependent iteration. [12] K.K. Parhi and D.G. Messerschmitt. Statuc rate-optimal scheduling of iterative data-BLOCKINow programs via optimum unfolding. Direct synthesis of optimized DSP assembly code from signal ow block diagrams. [14] H. Printz. Auto...
متن کاملRclp: a Novel Approach for Resource-constrained Loop Pipelining Rclp:a Novel Approach for Resource-constrained Loop Pipelining 3
In this paper a novel technique for resource-constrained loop pipelining is presented. RCLP is based on several dependence graph operations: loop unrolling, operation retiming, resource-constrained scheduling, and span reduction. All these operations are focused to nd a minimum length schedule able to be executed with a limited number of resources and thus maximizing resource utilization. Exper...
متن کاملInstruction Re-selection for Iterative Modulo Scheduling on High Performance Multi-issue DSPs
An iterative modulo scheduling is very important for compilers targeting high performance multi-issue digital signal processors. This is because these processors are often severely limited by idle state functional units and thus the reduced idle units can have a positively significant impact on their performance. However, complex instructions, which are used in most recent DSPs such as mac, usu...
متن کاملDecomposed Software Pipelining: A New Approach to Exploit Instruction Level Parallelism for Loop Programs
This paper presents a new view on software pipelining, in which we consider software pipelining as an instruction level transformation from a vector of one-dimension to a matrix of two-dimensions. Thus, the software pipelining problem can be naturally decomposed into two subproblems, one is to determine the row-numbers of operations in the matrix and another is to determine the column-numbers. ...
متن کامل